Just Annexation

Polyhedral annexation in mixed integer and combinatorial programming

Polyhedral annexation is a new approach for generating all valid inequalities in mixed integer and combinatorial programming. These include the facets of the convex hull of feasible integer solutions. The approach is capable of exploiting the characteristics of tile feasible solution space in regions both "adjacent to" and "distant from" the linear programming vertex without resorting to specia...

Is Just War Theory Obsolete?

Just War Theory can be found in almost all major cultures. But since war was a business that could not be easily stopped, some aimed to constrain it. In its classic form, Just War Theory has been around for several centuries—ever since nationhood in Europe replaced provincial governments. Having made some introductory considerations, I will ask: should Just War Theory be left as it is, changed,...

Using GIS technology to assess the prudence of municipal growth through annexation

Just-So Oscillation: as Just as MSW?

The neutrino long wavelength (just-so) oscillation is reconsidered as a solution to the solar neutrino problem. In the light of the presently updated results of the four solar neutrino experiments, the data fit in the just-so scenario substantially improves and becomes almost as good as in the MSW scenario. Surprising result of our analysis is that best fit is achieved when the oscillation occu...

A Search-based Approach to Annexation and Merging in Weighted Voting Games

Weighted voting games are classic cooperative games which provide a compact representation for coalition formation models in multiagent systems. We consider manipulation in weighted voting games via annexation and merging, which involves an agent or some agents misrepresenting their identities in anticipation of gaining more power at the expense of other agents in a game. We show that annexatio...